Interval graph representation with given interval and intersection lengths
نویسندگان
چکیده
منابع مشابه
Interval Graph Representation with Given Interval and Intersection Lengths
We consider the problem of finding interval representations of graphs that additionally respect given interval lengths and/or pairwise intersection lengths, which are represented as weight functions on the vertices and edges, respectively. Pe’er and Shamir proved that the problem is NP-complete if only the former are given [SIAM J. Discr. Math. 10.4, 1997]. We give both a linear-time and a logs...
متن کاملRobust Ray Intersection with Interval Arithmetic
For more general types of equations f (t) = 0, the problem of finding roots can be divided into two steps. First the roots must be isolated by finding intervals [ti , ti+1] which are known to contain one and only one root of the function. Secondly, the intervals about each root can be refined by reducing the size of the isolating interval until the root is located as accurately as possible usin...
متن کاملSimultaneous Representation of Interval and Interval-Containment Orders
We characterize the polysemic interval pairs|pairs of posets that admit simultaneous interval and interval-containment representations|and present algorithms to recognize them and construct polysemic interval representations.
متن کاملInterval Graph Limits.
We work out a graph limit theory for dense interval graphs. The theory developed departs from the usual description of a graph limit as a symmetric function W (x, y) on the unit square, with x and y uniform on the interval (0, 1). Instead, we fix a W and change the underlying distribution of the coordinates x and y. We find choices such that our limits are continuous. Connections to random inte...
متن کاملCapacitated max -Batching with Interval Graph Compatibilities
We consider the problem of partitioning interval graphs into cliques of bounded size. Each interval has a weight, and the cost of a clique is the maximum weight of any interval in the clique. This natural graph problem can be interpreted as a batch scheduling problem. Solving an open question from [7, 4, 5], we show NP-hardness, even if the bound on the clique sizes is constant. Moreover, we gi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2015
ISSN: 1570-8667
DOI: 10.1016/j.jda.2015.05.011